- AMORTIZED VALUES
- амортизированные отчисления. . Словарь экономических терминов .
Англо-русский экономический словарь.
AMORTIZED VALUES
Смотреть что такое "AMORTIZED VALUES" в других словарях:
ОТЧИСЛЕНИЯ АМОРТИЗАЦИОННЫЕ — AMORTIZED VALUESПри оценке облигации самые низкие О.а. как разница между исходной ценой издержек и АМОРТИЗАЦИЕЙ премии (на базе равномерной амортизации) к моменту погашения или до него. Такова, напр., база расчета, предписываемая штатом Нью Йорк… … Энциклопедия банковского дела и финансов
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
Deferred Acquisition Costs — (DAC) is a term commonly used in the insurance business. It describes the practice of deferring the cost of acquiring a new customer over the duration of the insurance contract. Insurance companies face large upfront costs incurred in issuing new … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Dynamic array — Several values are inserted at the end of a dynamic array using geometric expansion. Grey cells indicate space reserved for expansion. Most insertions are fast (constant time), while some are slow due to the need for reallocation (Θ(n) time,… … Wikipedia
Negative amortization — In finance, negative amortization, also known as NegAm, deferred interest or graduated payment mortgage, occurs whenever the loan payment for any period is less than the interest charged over that period so that the outstanding balance of the… … Wikipedia
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Mark-to-market accounting — Accountancy Key concepts Accountant · Accounting period · Bookkeeping · Cash and accrual basis · Cash flow management · Chart of accounts … Wikipedia
Standard Template Library — C++ Standard Library fstream iomanip ios iostream sstream string … Wikipedia
Soft heap — In computer science, the soft heap, designed by Bernard Chazelle in 2000, is a variant on the simple heap data structure. By carefully corrupting (increasing) the keys of at most a certain fixed percentage of values in the heap, it is able to… … Wikipedia
Search data structure — In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database. The simplest, most general, and least efficient search… … Wikipedia
